import java.util.Scanner;

/**
 * Created with IntelliJ IDEA
 * Description:
 * User: Administrator
 * Data: 2023 - 10 - 15
 * Time: 12:42
 */
//牛客 查找组成一个偶数最接近的两个素数
public class Solution12 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int n = in.nextInt();
            int half = n / 2;
            for (int i = half; i > 0; i++) {
                if(isPrime(i) && isPrime(n - i)) {
                    System.out.println(n - i);
                    System.out.println(i);
                    break;
                }
            }
        }
    }
    public static boolean isPrime(int n) {
        for (int i = 2; i * i <= n ; i++) {
            if(n % i == 0) {
                return false;
            }
        }
        return true;
    }
}
